1385D - a-Good String - CodeForces Solution


bitmasks brute force divide and conquer dp implementation *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define omar ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define ln "\n"
ll n;
string s;
vector<vector<ll>>v(2e5+4,vector<ll>(26));
ll sol (int i=1, int m=n ,char x='a')
{
    if(i==m)
        return s[i]!=x;
    int ind1=(i+m)/2+1,ind2=(i+m)/2;
    ll fir = sol(ind1,m,x+1)+(m-i+1)/2-(v[ind1-1][x-'a']-v[i-1][x-'a']);
    ll sec = sol(i,ind2,x+1)+(m-i+1)/2-(v[m][x-'a']-v[ind2][x-'a']);
    return min(fir,sec);
}
int main() {
    omar;
    ll t=1;
    cin >> t;
    while (t--) {
        cin >> n >> s;
        s='#'+s;
        for(int i=1;i<=n;i++)
        {
            v[i]=v[i-1];
            v[i][s[i]-'a']++;
        }
        cout << sol() << ln;
    }

}

	  		  				  	 		 	     	    	


Comments

Submit
0 Comments
More Questions

Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array